Estimates of Distance
نویسندگان
چکیده
منابع مشابه
Optimal robust estimates using the Hellinger distance
Optimal robust M-estimates of a multidimensional parameter are described using Hampel’s infinitesimal approach. The optimal estimates are derived by minimizing a measure of efficiency under the model, subject to a bounded measure of infinitesimal robustness. To this purpose we define measures of efficiency and infinitesimal sensitivity based on the Hellinger distance. We show that these two mea...
متن کاملUsing Distance Estimates in Heuristic Search
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is not the same as search-distance-to-go. We evaluate two previous proposals: dynamically weighted A∗ and A∗ ǫ . We present a revision to dynamically weighted A∗ that improves its performance substantially in domains whe...
متن کاملEfficient Hellinger distance estimates for semiparametric models
Minimum distance techniques have become increasingly important tools for solving statistical estimation and inference problems. In particular, the successful application of the Hellinger distance approach to fully parametric models is well known. The corresponding optimal estimators, known as minimum Hellinger distance estimators, achieve efficiency at the model density and simultaneously posse...
متن کاملComparing Remotely Sensed Pictometry® Web Based Slope Distance Estimates with In Situ Total Station and Tape Slope Distance Estimates
Slope distance was measured between the top of 30 light poles and their respective ground level coordinate identified within a central parking lot on the campus of Stephen F. Austin State University, Nacogdoches, Texas. Slope distance measured using Pictometry® hyperspatial 4-inch (10.2 centimeters) multispectral imagery within a web based interface was compared to in situ total station and tap...
متن کاملEstimates of the distance distribution of nonbinary codes, with applications
We use the polynomial method to derive upper and lower bounds on the distance distribution of nonbinary codes in the Hamming space. Applications of the bounds include a better asymptotic upper bound on the weight distribution of Goppa codes from maximal curves, a new upper bound on the size of a q-ary code with a given rth generalized weight, improved estimates of the size of secant spaces of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 1892
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.ns-19.475.149